Lossless image coding using hierarchical decomposition and recursive partitioning

نویسندگان

  • mortuza ali
  • manzur murshed
  • shampa shahriyar
  • manoranjan paul
چکیده

State-of-the-art lossless image compression schemes, such as JPEG-LS and CALIC, have been proposed in the context-adaptive predictive coding framework. These schemes involve a prediction step followed by context-adaptive entropy coding of the residuals. However, the models for context determination proposed in the literature, have been designed using ad-hoc techniques. In this paper, we take an alternative approach where we fix a simpler context model and then rely on a systematic technique to efficiently exploit spatial correlation to achieve efficient compression. The essential idea is to decompose the image into binary bitmaps such that the spatial correlation that exists among non-binary symbols is captured as the correlation among few bit positions. The proposed scheme then encodes the bitmaps in a particular order based on the simple context model. However, instead of encoding a bitmap as a whole, we partition it into rectangular blocks, induced by a binary tree, and then independently encode the blocks. Themotivation for partitioning is to explicitly identify the blocks within which the statistical correlation remains the same. On a set of standard test images, the proposed scheme, using the same predictor as JPEG-LS, achieved an overall bit-rate saving of 1.56% against JPEG-LS.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Medical Image Compression Using a Novel Embedded Set Partitioning Significant and Zero Block Coding

Lossless compression with progressive transmission is playing a key role in telemedicine applications. The proposed lossless embedded progressive region based significant and zero block coding uses a recursive set partitioning procedure to sort subsets of wavelet coefficients by maximum magnitude with respect to thresholds that are integer powers of two. It exploits two fundamental characterist...

متن کامل

Low-Complexity Waveform Coding via Alphabet and Sample-Set Partitioning

We propose a new low-complexity entropy-coding method to be used for coding waveform signals. It is based on the combination of two schemes: (1) an alphabet partitioning method to reduce the complexity of the entropy-coding process; (2) a new recursive set partitioning entropy-coding process that achieves rates smaller than rst order entropy even with fast Hu man adaptive codecs. Numerical resu...

متن کامل

An Enhanced Lossless Image Compression Based on Hierarchical Prediction Context Adaptive Coding

To display high bit resolution images on low bit resolution displays, bit resolution needs to be reduced. Towards achieving a reduced bit rates and high compression gain, an enhanced method for compression of various color images are presented, which is based on hierarchical prediction and adaptive coding. An RGB image is first transformed to YCbCr by a reversible color transform and a various ...

متن کامل

Embedded to Lossless Image Coding (elic)

In this paper, a novel approach for Embedded to Lossless Image Coding (ELIC) is presented. With embedded to lossless coding, lossy encodings of the image at all lower bit rates are embedded in the lossless bit stream. This algorithm uses wavelet transforms that map integers to integers with embedded coding. The coding is based on bit significance criteria in which coefficients that become signi...

متن کامل

Image Fusion and Re-Modified SPIHT for Fused Image

This paper presents the Discrete Wavelet based fusion techniques for combining perceptually important image features. SPIHT (Set Partitioning in Hierarchical Trees) algorithm is an efficient method for lossy and lossless coding of fused image. This paper presents some modifications on the SPIHT algorithm. It is based on the idea of insignificant correlation of wavelet coefficient among the medi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016